Decidability of periodicity for infinite words
نویسندگان
چکیده
منابع مشابه
On the Frequency and Periodicity of Infinite Words On the Frequency and Periodicity of Infinite Words
This work contributes to two aspects of the understanding of infinite words: the frequency of letters in a morphic sequence and periodicity considerations on infinite words. First, we develop a necessary and sufficient criteria for the existence of the frequency of a letter in a morphic sequence, and give some applications of this result. We show that the frequencies of all letters exist in pur...
متن کاملThe Decidability Frontier for Probabilistic Automata on Infinite Words
We consider probabilistic automata on infinite words with acceptance defined by safety, reachability, Büchi, coBüchi, and limitaverage conditions. We consider quantitative and qualitative decision problems. We present extensions and adaptations of proofs for probabilistic finite automata and present a complete characterization of the decidability and undecidability frontier of the quantitative ...
متن کاملA characterization of periodicity of bi-infinite words
A finite word is called bordered if it has a proper prefix which is also a suffix of that word. Costa proves in (Theoret. Comput. Sci., 290(3):2053–2061, 2003) that a bi-infinite word w is of the form fgf, for some finite words f and g, if, and only if, there is a factorization w = suv, with u ∈ A such that every factor suv, with s 4 s and v ≤ v, is bordered. We present a shorter proof of that ...
متن کاملOn periodicity of generalized two-dimensional infinite words
A generalized two-dimensional word is a function on Z with a finite number of values. The main problem we are interested in is periodicity of twodimensional words satisfying some local conditions. Let A be a matrix of order n. The function φ : Z → R is a generalized centered function of radius r with the matrix A if ∑ y ∈ Z2 : 0 < |y − x| ≤ r φ(y) = φ(x)A for every x ∈ Z, where for x = (x1, x2)...
متن کاملProbabilistic Automata on Infinite Words: Decidability and Undecidability Results
We consider probabilistic automata on infinite words with acceptance defined by safety, reachability, Büchi, coBüchi and limitaverage conditions. We consider quantitative and qualitative decision problems. We present extensions and adaptations of proofs of [GO09] and present a precise characterization of the decidability and undecidability frontier of the quantitative and qualitative decision p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 1986
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/1986200100431